type crypto/x509.policyGraphNode

28 uses

	crypto/x509 (current package)
		verify.go#L1056: type policyGraphNode struct {
		verify.go#L1061: 	parents  map[*policyGraphNode]bool
		verify.go#L1062: 	children map[*policyGraphNode]bool
		verify.go#L1065: func newPolicyGraphNode(valid OID, parents []*policyGraphNode) *policyGraphNode {
		verify.go#L1066: 	n := &policyGraphNode{
		verify.go#L1069: 		children:          map[*policyGraphNode]bool{},
		verify.go#L1070: 		parents:           map[*policyGraphNode]bool{},
		verify.go#L1080: 	strata []map[string]*policyGraphNode
		verify.go#L1082: 	parentIndex map[string][]*policyGraphNode
		verify.go#L1089: 	root := policyGraphNode{
		verify.go#L1092: 		children:          map[*policyGraphNode]bool{},
		verify.go#L1093: 		parents:           map[*policyGraphNode]bool{},
		verify.go#L1097: 		strata: []map[string]*policyGraphNode{{string(anyPolicyOID.der): &root}},
		verify.go#L1101: func (pg *policyGraph) insert(n *policyGraphNode) {
		verify.go#L1105: func (pg *policyGraph) parentsWithExpected(expected OID) []*policyGraphNode {
		verify.go#L1112: func (pg *policyGraph) parentWithAnyPolicy() *policyGraphNode {
		verify.go#L1119: func (pg *policyGraph) parents() iter.Seq[*policyGraphNode] {
		verify.go#L1126: func (pg *policyGraph) leaves() map[string]*policyGraphNode {
		verify.go#L1130: func (pg *policyGraph) leafWithPolicy(policy OID) *policyGraphNode {
		verify.go#L1148: func (pg *policyGraph) validPolicyNodes() []*policyGraphNode {
		verify.go#L1149: 	var validNodes []*policyGraphNode
		verify.go#L1182: 	pg.parentIndex = map[string][]*policyGraphNode{}
		verify.go#L1190: 	pg.strata = append(pg.strata, map[string]*policyGraphNode{})
		verify.go#L1266: 						parents = []*policyGraphNode{anyParent}
		verify.go#L1280: 				missing := map[string][]*policyGraphNode{}
		verify.go#L1326: 							n := newPolicyGraphNode(OID{der: []byte(issuerStr)}, []*policyGraphNode{matching})
		verify.go#L1374: 	var validPolicyNodeSet []*policyGraphNode